# 递归函数案例  函数自己调用自己
#求n的阶乘 n*n-1 ..
result = 1
n = int(input("请输入一个数字"))
while n >= 1:
    result *= n
    n -= 1
print(result)

def diGui(n):
    if n>1:
        return  n*diGui(n-1)
    else:
        return 1

print(diGui(3))

# goodsList = [
#     {"name":"快乐肥宅"}
#
# ]
#
# def search(goodsList):
#     for goods in goodsList:
#         if goods["name"]==goods["name"]:
#             return {"status":True, "goods":goods}
#     return {"status":False, "goods":goodsList}
#
# print(search("快乐肥宅"))


# 作业去重











